0.06/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.11/0.32	% Computer : n007.cluster.edu
0.11/0.32	% Model    : x86_64 x86_64
0.11/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory   : 8042.1875MB
0.11/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1920
0.11/0.32	% WCLimit    : 240
0.11/0.32	% DateTime   : Wed Jul 30 02:03:49 EDT 2025
0.17/0.33	% CPUTime    : 
0.20/0.47	Running higher-order theorem proving
0.20/0.50	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.8FrsZavq6V/E---3.1_31445.p
0.20/0.57	# Version: 3.0.0-ho
0.20/0.57	# Preprocessing class: HSLMSMSMSSSNHSA.
0.20/0.57	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.57	# Starting ho_unfolding_3 with 1200s (5) cores
0.20/0.57	# Starting sh7 with 240s (1) cores
0.20/0.57	# Starting ho_unfolding_2 with 240s (1) cores
0.20/0.57	# Starting new_bool_12 with 240s (1) cores
0.20/0.57	# ho_unfolding_3 with pid 31562 completed with status 0
0.20/0.57	# Result found by ho_unfolding_3
0.20/0.57	# Preprocessing class: HSLMSMSMSSSNHSA.
0.20/0.57	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.57	# Starting ho_unfolding_3 with 1200s (5) cores
0.20/0.57	# No SInE strategy applied
0.20/0.57	# Search class: HGHSF-FFMM21-SHSFFFBN
0.20/0.57	# Scheduled 5 strats onto 5 cores with 1200 seconds (1200 total)
0.20/0.57	# Starting ho_unfolding_3 with 721s (1) cores
0.20/0.57	# Starting sh5l with 121s (1) cores
0.20/0.57	# Starting ehoh_best8_lambda with 121s (1) cores
0.20/0.57	# Starting lpo8_lambda_fix with 121s (1) cores
0.20/0.57	# Starting sh4l with 116s (1) cores
0.20/0.57	# sh5l with pid 31575 completed with status 0
0.20/0.57	# Result found by sh5l
0.20/0.57	# Preprocessing class: HSLMSMSMSSSNHSA.
0.20/0.57	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.57	# Starting ho_unfolding_3 with 1200s (5) cores
0.20/0.57	# No SInE strategy applied
0.20/0.57	# Search class: HGHSF-FFMM21-SHSFFFBN
0.20/0.57	# Scheduled 5 strats onto 5 cores with 1200 seconds (1200 total)
0.20/0.57	# Starting ho_unfolding_3 with 721s (1) cores
0.20/0.57	# Starting sh5l with 121s (1) cores
0.20/0.57	# Preprocessing time       : 0.004 s
0.20/0.57	# Presaturation interreduction done
0.20/0.57	
0.20/0.57	# Proof found!
0.20/0.57	# SZS status Theorem
0.20/0.57	# SZS output start CNFRefutation
0.20/0.57	thf(decl_58, type, lAnna_THFTYPE_i: $i).
0.20/0.57	thf(decl_63, type, lBill_THFTYPE_i: $i).
0.20/0.57	thf(decl_66, type, lBob_THFTYPE_i: $i).
0.20/0.57	thf(decl_95, type, lSue_THFTYPE_i: $i).
0.20/0.57	thf(decl_105, type, likes_THFTYPE_IiioI: $i > $i > $o).
0.20/0.57	thf(decl_114, type, parent_THFTYPE_IiioI: $i > $i > $o).
0.20/0.57	thf(decl_138, type, esk2_0: $i).
0.20/0.57	thf(decl_139, type, esk3_0: $i).
0.20/0.57	thf(decl_152, type, esk16_0: $i).
0.20/0.57	thf(decl_153, type, esk17_0: $i).
0.20/0.57	thf(con, conjecture, ?[X58:$i > $i > $o, X59:$i > $i > $o, X25:$i]:(((((X59 @ X25 @ lBill_THFTYPE_i)&(X58 @ X25 @ lAnna_THFTYPE_i))&~(((X59)=(^[X51:$i, X60:$i]:(($true))))))&~(((X58)=(^[X51:$i, X60:$i]:(($true))))))), file('/export/starexec/sandbox2/tmp/tmp.8FrsZavq6V/E---3.1_31445.p', con)).
0.20/0.57	thf(ax_029, axiom, ?[X24:$i, X25:$i]:(~((parent_THFTYPE_IiioI @ X24 @ X25))), file('/export/starexec/sandbox2/tmp/tmp.8FrsZavq6V/E---3.1_31445.p', ax_029)).
0.20/0.57	thf(ax_004, axiom, ?[X24:$i, X25:$i]:(~((likes_THFTYPE_IiioI @ X24 @ X25))), file('/export/starexec/sandbox2/tmp/tmp.8FrsZavq6V/E---3.1_31445.p', ax_004)).
0.20/0.57	thf(ax_051, axiom, (parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i), file('/export/starexec/sandbox2/tmp/tmp.8FrsZavq6V/E---3.1_31445.p', ax_051)).
0.20/0.57	thf(ax_060, axiom, (likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i), file('/export/starexec/sandbox2/tmp/tmp.8FrsZavq6V/E---3.1_31445.p', ax_060)).
0.20/0.57	thf(c_0_5, negated_conjecture, ~(?[X58:$i > $i > $o, X59:$i > $i > $o, X25:$i]:(((((X59 @ X25 @ lBill_THFTYPE_i)&(X58 @ X25 @ lAnna_THFTYPE_i))&~(![X225:$i, X226:$i]:(((X59 @ X225 @ X226)<=>$true))))&~(![X227:$i, X228:$i]:(((X58 @ X227 @ X228)<=>$true)))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])])])).
0.20/0.57	thf(c_0_6, negated_conjecture, ![X392:$i > $i > $o, X393:$i > $i > $o, X394:$i, X395:$i, X396:$i, X397:$i, X398:$i]:((((~(X392 @ X397 @ X398)|($true)|(~(X393 @ X395 @ X396)|($true)|(~(X393 @ X394 @ lBill_THFTYPE_i)|~(X392 @ X394 @ lAnna_THFTYPE_i))))&(~($true)|(X392 @ X397 @ X398)|(~(X393 @ X395 @ X396)|($true)|(~(X393 @ X394 @ lBill_THFTYPE_i)|~(X392 @ X394 @ lAnna_THFTYPE_i)))))&((~(X392 @ X397 @ X398)|($true)|(~($true)|(X393 @ X395 @ X396)|(~(X393 @ X394 @ lBill_THFTYPE_i)|~(X392 @ X394 @ lAnna_THFTYPE_i))))&(~($true)|(X392 @ X397 @ X398)|(~($true)|(X393 @ X395 @ X396)|(~(X393 @ X394 @ lBill_THFTYPE_i)|~(X392 @ X394 @ lAnna_THFTYPE_i))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])).
0.20/0.57	thf(c_0_7, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X4:$i, X58:$i > $i > $o, X40:$i > $i > $o, X5:$i]:(((X40 @ X1 @ X2)|(X58 @ X3 @ X4)|~(($true))|~(($true))|~((X58 @ X5 @ lBill_THFTYPE_i))|~((X40 @ X5 @ lAnna_THFTYPE_i)))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.20/0.57	thf(c_0_8, plain, ?[X24:$i, X25:$i]:(~(parent_THFTYPE_IiioI @ X24 @ X25)), inference(fof_simplification,[status(thm)],[ax_029])).
0.20/0.57	thf(c_0_9, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X4:$i, X58:$i > $i > $o, X40:$i > $i > $o, X5:$i]:(((X58 @ X3 @ X4)|(X40 @ X1 @ X2)|~((X58 @ X5 @ lBill_THFTYPE_i))|~((X40 @ X5 @ lAnna_THFTYPE_i)))), inference(cn,[status(thm)],[c_0_7])).
0.20/0.57	thf(c_0_10, plain, ?[X24:$i, X25:$i]:(~(likes_THFTYPE_IiioI @ X24 @ X25)), inference(fof_simplification,[status(thm)],[ax_004])).
0.20/0.57	thf(c_0_11, plain, ~(parent_THFTYPE_IiioI @ esk16_0 @ esk17_0), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_8])])])).
0.20/0.57	thf(c_0_12, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X40:$i > $i > $o, X4:$i]:((((lBill_THFTYPE_i)=(X1))|(X40 @ X2 @ X3)|~((X40 @ X4 @ lAnna_THFTYPE_i)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_9])).
0.20/0.57	thf(c_0_13, plain, (parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i), inference(split_conjunct,[status(thm)],[ax_051])).
0.20/0.57	thf(c_0_14, plain, ~(likes_THFTYPE_IiioI @ esk2_0 @ esk3_0), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_10])])])).
0.20/0.57	thf(c_0_15, plain, ~((parent_THFTYPE_IiioI @ esk16_0 @ esk17_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.57	thf(c_0_16, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:((((lBill_THFTYPE_i)=(X1))|(parent_THFTYPE_IiioI @ X2 @ X3))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
0.20/0.57	thf(c_0_17, plain, ~((likes_THFTYPE_IiioI @ esk2_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.57	thf(c_0_18, negated_conjecture, ![X1:$i]:(((lBill_THFTYPE_i)=(X1))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.20/0.57	thf(c_0_19, plain, ~((likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_18]), c_0_18])).
0.20/0.57	thf(c_0_20, plain, (likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i), inference(split_conjunct,[status(thm)],[ax_060])).
0.20/0.57	thf(c_0_21, negated_conjecture, ![X1:$i]:(~((likes_THFTYPE_IiioI @ X1 @ X1))), inference(spm,[status(thm)],[c_0_19, c_0_18])).
0.20/0.57	thf(c_0_22, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_20, c_0_18]), c_0_21]), ['proof']).
0.20/0.57	# SZS output end CNFRefutation
0.20/0.57	# Parsed axioms                        : 330
0.20/0.57	# Removed by relevancy pruning/SinE    : 0
0.20/0.57	# Initial clauses                      : 349
0.20/0.57	# Removed in clause preprocessing      : 128
0.20/0.57	# Initial clauses in saturation        : 221
0.20/0.57	# Processed clauses                    : 552
0.20/0.57	# ...of these trivial                  : 14
0.20/0.57	# ...subsumed                          : 29
0.20/0.57	# ...remaining for further processing  : 508
0.20/0.57	# Other redundant clauses eliminated   : 2
0.20/0.57	# Clauses deleted for lack of memory   : 0
0.20/0.57	# Backward-subsumed                    : 4
0.20/0.57	# Backward-rewritten                   : 178
0.20/0.57	# Generated clauses                    : 527
0.20/0.57	# ...of the previous two non-redundant : 669
0.20/0.57	# ...aggressively subsumed             : 0
0.20/0.57	# Contextual simplify-reflections      : 0
0.20/0.57	# Paramodulations                      : 517
0.20/0.57	# Factorizations                       : 0
0.20/0.57	# NegExts                              : 0
0.20/0.57	# Equation resolutions                 : 3
0.20/0.57	# Disequality decompositions           : 0
0.20/0.57	# Total rewrite steps                  : 284
0.20/0.57	# ...of those cached                   : 192
0.20/0.57	# Propositional unsat checks           : 0
0.20/0.57	#    Propositional check models        : 0
0.20/0.57	#    Propositional check unsatisfiable : 0
0.20/0.57	#    Propositional clauses             : 0
0.20/0.57	#    Propositional clauses after purity: 0
0.20/0.57	#    Propositional unsat core size     : 0
0.20/0.57	#    Propositional preprocessing time  : 0.000
0.20/0.57	#    Propositional encoding time       : 0.000
0.20/0.57	#    Propositional solver time         : 0.000
0.20/0.57	#    Success case prop preproc time    : 0.000
0.20/0.57	#    Success case prop encoding time   : 0.000
0.20/0.57	#    Success case prop solver time     : 0.000
0.20/0.57	# Current number of processed clauses  : 112
0.20/0.57	#    Positive orientable unit clauses  : 79
0.20/0.57	#    Positive unorientable unit clauses: 1
0.20/0.57	#    Negative unit clauses             : 4
0.20/0.57	#    Non-unit-clauses                  : 28
0.20/0.57	# Current number of unprocessed clauses: 544
0.20/0.57	# ...number of literals in the above   : 904
0.20/0.57	# Current number of archived formulas  : 0
0.20/0.57	# Current number of archived clauses   : 395
0.20/0.57	# Clause-clause subsumption calls (NU) : 1723
0.20/0.57	# Rec. Clause-clause subsumption calls : 1256
0.20/0.57	# Non-unit clause-clause subsumptions  : 31
0.20/0.57	# Unit Clause-clause subsumption calls : 369
0.20/0.57	# Rewrite failures with RHS unbound    : 83
0.20/0.57	# BW rewrite match attempts            : 826
0.20/0.57	# BW rewrite match successes           : 115
0.20/0.57	# Condensation attempts                : 552
0.20/0.57	# Condensation successes               : 7
0.20/0.57	# Termbank termtop insertions          : 22854
0.20/0.57	# Search garbage collected termcells   : 2196
0.20/0.57	
0.20/0.57	# -------------------------------------------------
0.20/0.57	# User time                : 0.040 s
0.20/0.57	# System time              : 0.010 s
0.20/0.57	# Total time               : 0.050 s
0.20/0.57	# Maximum resident set size: 2692 pages
0.20/0.57	
0.20/0.57	# -------------------------------------------------
0.20/0.57	# User time                : 0.188 s
0.20/0.57	# System time              : 0.026 s
0.20/0.57	# Total time               : 0.214 s
0.20/0.57	# Maximum resident set size: 1992 pages
0.20/0.57	% E exiting
0.20/0.57	% E exiting
0.20/0.57	EOF